z-Approximations

نویسندگان

  • Refael Hassin
  • Samir Khuller
چکیده

Approximation algorithms for NP-hard optimization problems have been widely studied for over three decades. Most of these measure the quality of the solution produced by taking the ratio of the cost of the solution produced by the algorithm to the cost of an optimal solution. In certain cases, this ratio may not be very meaningful { for example , if the ratio of the worst solution to the best solution is at most some constant , then an approximation algorithm with factor may in fact yield the worst solution! To overcome this hurdle (among others), several authors have independently suggested the use of a diierent measure which we call z-approximation. An algorithm is an z-approximation if it runs in polynomial time, and produces a solution whose distance from the optimal one is at most times the distance between the optimal solution and the worst possible solution. The results known so far about z-approximations are either of the inapproximability type or rather straightforward observations. We design polynomial time algorithms for several fundamental discrete optimization problems, in particular we obtain a z-approximation factor of 1 2 for the directed traveling salesman problem (TSP) (with no triangle inequality assumption). For the undirected TSP this improves to 1 3. We also show that if there is a polynomial time algorithm that for any xed > 0 yields an z-approximation then P = NP. We also present z-approximations for several other problems such as max cut, stacker crane, maximum acyclic subgraph, minimum disjoint cycle cover.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algorithm for approximating nondominated points of convex multiobjective optimization problems

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

متن کامل

Summation by Parts Operators for Finite Difference Approximations of Second-Derivatives with Variable Coefficients

Finite difference operators approximating second derivatives with variable coefficients and satisfying a summation-by-parts rule have been derived for the second-, fourthand sixth-order case by using the symbolic mathematics software Maple. The operators are based on the same norms as the corresponding approximations of the first derivate, which makes the construction of stable approximations t...

متن کامل

Flexible piecewise approximations based on partition of unity

In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally smooth up to any order, enjoy polynomial reproducing conditions, and satisfy nodal interpolation conditions for function values and derivatives of any order. We present various properties of the approximations, that are...

متن کامل

Approximations of the Standard Normal Distribution

This paper presents five new formulas for approximation of cumulative standard normal probabilities. Two of these approximations are polynomial based and are only accurate for 1 0 ≤ ≤ z ; the other three formulas are accurate on the interval 4 . 3 4 . 3 ≤ ≤ − z which is the domain often used in normal tables. We recommend the last of these new formulas.

متن کامل

Atomic energies from the large-dimension limit

Analytic approximations to nonrelativistic atomic ground state energies are obtained from the first two terms of the 1/ D expansion for the N-electron atom. These two terms describe the equilibrium structure (D-+ ct) limit) and normal mode oscillations (1/D term) of a completely symmetric N-dimensional configuration of localized particles. The connection between these large-D results and real a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Algorithms

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2001